0.00/0.01	% File    : /export/starexec/sandbox/benchmark/theBenchmark.p
0.00/0.01	% app-encoded or not : original
0.00/0.01	% Variant    : purification_ext
0.00/0.01	% Ordering    : kbo
0.00/0.01	% Command    : 
0.00/0.01	#!/bin/sh
0.00/0.01	
0.00/0.01	./zipperposition.native ${1:+"$1"} \
0.00/0.01	  -i tptp \
0.00/0.01	  -o tptp \
0.00/0.01	  --timeout "$STAREXEC_WALLCLOCK_LIMIT" \
0.00/0.01	  --mem-limit "$STAREXEC_MAX_MEM" \
0.00/0.01	  --no-avatar \
0.00/0.01	  --ho \
0.00/0.01	  --force-ho \
0.00/0.01	  --no-ho-elim-pred-var \
0.00/0.01	  --ho-general-ext-pos \
0.00/0.01	  --no-ho-unif \
0.00/0.01	  --no-induction \
0.00/0.01	  --no-unif-pattern \
0.00/0.01	  --ord $2  \
0.00/0.01	  --simultaneous-sup false \
0.00/0.01	  --ho-purify ext \
0.00/0.01	  --ho-ext-axiom \
0.00/0.01	  --restrict-hidden-sup-at-vars \
0.00/0.01	  --ho-prim-enum none \
0.00/0.01	  --no-max-vars \
0.00/0.01	  --dont-select-ho-var-lits \
0.00/0.01	  --no-fool
0.00/0.19	% Computer   : n112.star.cs.uiowa.edu
0.00/0.19	% Model      : x86_64 x86_64
0.00/0.19	% CPU        : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
0.00/0.19	% Memory     : 32218.625MB
0.00/0.19	% OS         : Linux 3.10.0-693.2.2.el7.x86_64
0.00/0.19	% CPULimit   : 300
0.00/0.19	% DateTime   : Fri Feb  2 17:23:39 CST 2018
0.00/0.20	% done 12 iterations in 0.005s
0.00/0.20	% SZS status Theorem for '/export/starexec/sandbox/benchmark/theBenchmark.p'
0.00/0.20	% SZS output start Refutation
0.00/0.21	tff(binunionTEcontra, conjecture,
0.00/0.21	  (binunionE =>
0.00/0.21	   (![A,X]:
0.00/0.21	      (in(X,powerset(A)) =>
0.00/0.21	       (![Y]:
0.00/0.21	          (in(Y,powerset(A)) =>
0.00/0.21	           (![Xx]:
0.00/0.21	              (in(Xx,A) =>
0.00/0.21	               ((~in(Xx,X)) => ((~in(Xx,Y)) => (~in(Xx,binunion(X,Y))))))))))))).
0.00/0.21	tff(zf_stmt_0, negated_conjecture,
0.00/0.21	  (~
0.00/0.21	    (binunionE =>
0.00/0.21	     (![A,X]:
0.00/0.21	        (in(X,powerset(A)) =>
0.00/0.21	         (![Y]:
0.00/0.21	            (in(Y,powerset(A)) =>
0.00/0.21	             (![Xx]:
0.00/0.21	                (in(Xx,A) =>
0.00/0.21	                 ((~in(Xx,X)) => ((~in(Xx,Y)) => (~in(Xx,binunion(X,Y)))))))))))))).
0.00/0.21	tff('0', plain, in(sk_Xx1, binunion(sk_X, sk_Y)),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff(binunionE, axiom,
0.00/0.21	  (binunionE <=> (![A,B,Xx]: (in(Xx,binunion(A,B)) => (in(Xx,B) | in(Xx,A)))))).
0.00/0.21	tff('1', plain,
0.00/0.21	    ![X0, X1, X2]:
0.00/0.21	      (~ in(X0, binunion(X1, X2)) | in(X0, X2) | in(X0, X1) | ~ binunionE),
0.00/0.21	    inference('cnf', [status(esa)], [binunionE])).
0.00/0.21	tff('2', plain, binunionE, inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('3', plain,
0.00/0.21	    ![X0, X1, X2]:
0.00/0.21	      (~ in(X0, binunion(X1, X2)) | in(X0, X2) | in(X0, X1) | ~ $true),
0.00/0.21	    inference('demod', [status(thm)], ['1', '2'])).
0.00/0.21	tff('4', plain,
0.00/0.21	    ![X0, X1, X2]: (in(X0, X1) | in(X0, X2) | ~ in(X0, binunion(X1, X2))),
0.00/0.21	    inference('simplify', [status(thm)], ['3'])).
0.00/0.21	tff('5', plain, (~ $true | in(sk_Xx1, sk_Y) | in(sk_Xx1, sk_X)),
0.00/0.21	    inference('sup-', [status(thm)], ['0', '4'])).
0.00/0.21	tff('6', plain, (in(sk_Xx1, sk_X) | in(sk_Xx1, sk_Y)),
0.00/0.21	    inference('simplify', [status(thm)], ['5'])).
0.00/0.21	tff('7', plain, ~ in(sk_Xx1, sk_X),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('8', plain, in(sk_Xx1, sk_Y), inference('clc', [status(thm)], ['6', '7'])).
0.00/0.21	tff('9', plain, ~ in(sk_Xx1, sk_Y),
0.00/0.21	    inference('cnf', [status(esa)], [zf_stmt_0])).
0.00/0.21	tff('10', plain, ~ $true, inference('sup-', [status(thm)], ['8', '9'])).
0.00/0.21	tff('11', plain, $false, inference('simplify', [status(thm)], ['10'])).
0.00/0.21	
0.00/0.21	% SZS output end Refutation
0.00/0.21	EOF
